1986A - X Axis - CodeForces Solution


brute force math sortings

Please click on ads to support us..

Python Code:

t = int(input())

for i in range(t):
    a = list(map(int,input().split()))
    
    f = 1000 
    f1 = 0 
    for j in range (1,11):
        f1=abs(a[0] - j) +  abs(a[1] - j) + abs(a[2] - j)

        f = min(f,f1)
        
    print(f)


Comments

Submit
0 Comments
More Questions

519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate